DNF complexity of complete boolean functions
نویسنده
چکیده
In this paper we analyse the complexity of boolean functions takes value 0 on a sufficiently small number of points. For many functions this leads to the analysis of a single function attains 0 only on unsigned representation of numbers from 1 to d for various d. Here we obtain a tight bounds on the DNF complexity of complete functions in terms of the number of literals and conjunctions. The method is based on a certain efficient approximation of the hypercube covering problem related to DNF complexity of a given boolean function.
منابع مشابه
The Minimum Equivalent DNF Problem and Shortest Implicants
We prove that the Minimum Equivalent DNF problem is p2-complete, resolving a conjecture due to Stockmeyer. The proof involves as an intermediate step a variant of a related problem in logic minimization, namely, that of finding the shortest implicant of a Boolean function. We also obtain certain results concerning the complexity of the Shortest Implicant problem that may be of independent inter...
متن کاملk-DNF and Acyclic Extensions of pdBfs
The problem of finding an extension of a partially defined Boolean function (pdBf) is the problem of finding a Boolean function, which correctly classifies given data. That means that in general we are given two sets of Boolean vectors truepoints and falsepoints and we want to decide if there exists an extension a Boolean function, that on all given truepoints has function value true and on all...
متن کاملOn DNF Approximators for Monotone Boolean Functions
We study the complexity of approximating monotone Boolean functions with disjunctive normal form (DNF) formulas, exploring two main directions. First, we construct DNF approximators for arbitrary monotone functions achieving one-sided error: we show that every monotone f can be ε-approximated by a DNF g of size 2n−Ωε( √ n) satisfying g(x) ≤ f(x) for all x ∈ {0, 1}. This is the first non-trivial...
متن کاملInductive Learning from Good Examples
We study what kind of data may ease the computational complexity of learning of Horn clause theories (in Gold's paradigm) and Boolean functions (in PAC-learning paradigm). We give several deenitions of good data (basic and generative representative sets), and develop data-driven algorithms that learn faster from good examples, and degenerate to learn in the limit from the \worst" possible examp...
متن کاملOn the Complexity and Inapproximability of Shortest Implicant Problems
We investigate the complexity and approximability of a basic optimization problem in the second level of the Polynomial Hierarchy, that of nding shortest implicants. We show that the DNF variant of this problem is complete for a complexity class in the second level of the hierarchy utilizing log 2 n-limited nondeterminism. We obtain inap-proximability results for the DNF and formula variants of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1501.01331 شماره
صفحات -
تاریخ انتشار 2015